Impact of Decision-Region Based Classi cation Mining Algorithms on Database Security
نویسندگان
چکیده
One of the challenges facing the computer science community is the development of techniques and tools to discover new and useful information from large collections of data. There are a number of basic issues associated with this challenge and many are still un-resolved. This situation has led to the emergence of a new area of study called \Knowledge Discovery in Databases" (KDD). The recent eeorts of KDD researchers have focused primarily on issues surrounding the individual steps of the discovery process. Those issues that are not directly related to the discovery process have received much less attention. One such issue is the impact of this new technology on database security. In this paper , we investigate issues pertaining to the assessment of the impact of classiication mining on database security. In particular, the security threat presented by a category of classiication mining algorithms that we refer to as decision-region based is analyzed. Providing safeguards against this threat requires, in part, the development of new security policies. Our speciic contributions are the proposal of a set of security policies for use in the context of decision-region based classi-cation mining algorithms along with the speciication and implementation of a security risk measure that allows for the realization of a subset of the proposed policies.
منابع مشابه
Impact of Decision-Region Based Classification Mining Algorithms on Database Security
In this paper, we investigate issues pertaining to the assessment of the impact of classification mining on database security. Specifically, the security threat presented by a category of classification mining algorithms that we refer to as decision-region based is analyzed. Providing safeguards against this threat requires, in part, the development of new security policies. Our specific contri...
متن کاملSPRINT: A Scalable Parallel Classi er for Data Mining
Classi cation is an important data mining problem. Although classi cation is a wellstudied problem, most of the current classication algorithms require that all or a portion of the the entire dataset remain permanently in memory. This limits their suitability for mining over large databases. We present a new decision-tree-based classi cation algorithm, called SPRINT that removes all of the memo...
متن کاملSLIQ: A Fast Scalable Classi er for Data Mining
Classi cation is an important problem in the emerging eld of data mining. Although classi cation has been studied extensively in the past, most of the classi cation algorithms are designed only for memory-resident data, thus limiting their suitability for data mining large data sets. This paper discusses issues in building a scalable classier and presents the design of SLIQ, a new classi er. SL...
متن کاملUsing Data Mining and Three Decision Tree Algorithms to Optimize the Repair and Maintenance Process
The purpose of this research is to predict the failure of devices using a data mining tool. For this purpose, at the outset, an appropriate database consists of 392 records of ongoing failures in a pharmaceutical company in 1394, in the next step, by analyzing 9 characteristics and type of failure as a database class, analyzes have been used. In this regard, three decision tree algorithms have ...
متن کاملData Mining using Nonmonotonic Connectionist Expert Systems
An application of Nonmonotonic Connectionist Expert Systems (NCESs) in mining classi cation rules from large relational databases is presented. NCESs are hybrid learning systems that can acquire symbolic knowledge of a nonmonotonic domain, represented using nonmonotonic inheritance networks. This initial knowledge can be re ned using connectionist learning techniques and a set of classi ed exam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999